Lossless Compression of Seismic Data into Fixed-Length Packets
نویسنده
چکیده
We present an algorithm to losslessly compress a sequence of integers. The intended application is to encode seismic data at nodes in a network of seismometers. The algorithm performs predictive compression, using adaptive linear filtering to predict sample values and encoding variable numbers of samples into fixed-length packets. To accommodate packet losses, the packets include sufficient overhead data to ensure that samples in each packet can be decoded without requiring data from preceding packets. Compression results are presented for seismic test data sets.
منابع مشابه
Seismographic Data Compression --Applying Modified Tunstall Coding--
The Standard for the Exchange of Earthquake Data (SEED) is a commonly used file format in the seismology field. Steim1 and Steim2 compression schemes, i.e. lossless data compressions, are used in SEED format and are written in Data Description Language (DDL), which has computational limitations making it difficult to implement many standard compression algorithms. Steim1 and Steim2 are fixed co...
متن کاملUniversal source coding for complementary delivery
This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical ana...
متن کاملLossless Seismic Data Compression using Adaptive Linear Prediction
This paper presents a comparison of adaptive linear pre-dictors as applied to the area of lossless compression of seismic waveform data. Three methods are explored: the normalize least-mean square (NLMS) algorithm, the gradient adaptive lattice (GAL) algorithm, and the recursive least squares lattice (RLSL) algorithm. When compared to standard linear prediction techniques, all three of these me...
متن کاملLZAC Lossless Data Compression
This paper presents LZAC, a new universal lossless data compression algorithm derived from the popular and widely used LZ77 family. The objective of LZAC is to improve the compression ratios of the LZ77 family while still retaining the family’s key characteristics: simple, universal, fast in decoding, and economical in memory consumption. LZAC presents two new ideas: composite fixed-variable-le...
متن کاملUniversal coding for correlated sources over generalized complementary delivery networks
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded, and each decoder has access to some of the messages to enable it to reproduce the other messages. Both fixed-to-fixed length and fixed-to-variable length los...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008